On Distribution of Well - Rounded Sublattices

ثبت نشده
چکیده

A lattice is called well-rounded if its minimal vectors span the corresponding Euclidean space. In this paper we completely describe well-rounded full-rank sublattices of Z 2 , as well as their determinant and minima sets. We show that the determinant set has positive density, deriving an explicit lower bound for it, while the minima set has density 0. We also produce formulas for the number of such lattices with a fixed determinant and with a fixed minimum. These formulas are related to the number of divisors of an integer in short intervals and to the number of its representations as a sum of two squares. We investigate the growth of the number of such lattices with a fixed determinant as the determinant grows, exhibiting some determinant sequences on which it is particularly large. To this end, we also study the behavior of the associated zeta function, comparing it to the Dedekind zeta function of Gaussian integers and to the Solomon zeta function of Z 2. Our results extend automatically to well-rounded sublattices of any lattice AZ 2 , where A is an element of the real orthogonal group O 2 (R).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Similarity Classes of Well-rounded Sublattices of Z

A lattice is called well-rounded if its minimal vectors span the corresponding Euclidean space. In this paper we study the similarity classes of well-rounded sublattices of Z2. We relate the set of all such similarity classes to a subset of primitive Pythagorean triples, and prove that it has the structure of a noncommutative infinitely generated monoid. We discuss the structure of a given simi...

متن کامل

ar X iv : 1 21 0 . 05 71 v 1 [ m at h . M G ] 1 O ct 2 01 2 Well - rounded sublattices and coincidence site lattices

A lattice is called well-rounded, if its lattice vectors of minimal length span the ambient space. We show that there are interesting connections between the existence of well-rounded sublattices and coincidence site lattices (CSLs). Furthermore, we count the number of well-rounded sublattices for several planar lattices and give their asymptotic behaviour.

متن کامل

On well-rounded sublattices of the hexagonal lattice

We produce an explicit parameterization of well-rounded sublattices of the hexagonal lattice in the plane, splitting them into similarity classes. We use this parameterization to study the number, the greatest minimal norm, and the highest signal-to-noise ratio of well-rounded sublattices of the hexagonal lattice of a fixed index. This investigation parallels earlier work by Bernstein, Sloane, ...

متن کامل

Well-Rounded Zeta-Function of Planar Arithmetic Lattices

We investigate the properties of the zeta-function of well-rounded sublattices of a fixed arithmetic lattice in the plane. In particular, we show that this function has abscissa of convergence at s = 1 with a real pole of order 2, improving upon a result of [11]. We use this result to show that the number of well-rounded sublattices of a planar arithmetic lattice of index less or equal N is O(N...

متن کامل

On Distribution of Well-Rounded Sublattices of Z2

A lattice is called well-rounded if its minimal vectors span the corresponding Euclidean space. In this paper we completely describe wellrounded full-rank sublattices of Z, as well as their determinant and minima sets. We show that the determinant set has positive density, deriving an explicit lower bound for it, while the minima set has density 0. We also produce formulas for the number of suc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007